CQP-Miner: Mining Conserved XML Query Patterns For Evolution-Conscious Caching

نویسنده

  • Sourav S Bhowmick
چکیده

Existing xml query pattern-based caching strategies focus on extracting the set of frequently issued query pattern trees (qpt) based on the support of the qpts in the history. These approaches ignore the evolutionary features of the qpts. In this paper, we propose a novel type of query pattern called conserved query paths (cqp) for efficient caching by integrating the support and evolutionary features together. cqps are paths in qpts that never change or do not change significantly most of the time (if not always) in terms of their support values during a specific time period. We proposed a set of algorithms to extract frequent cqps (fcqps) and infrequent cqps (icqps) and rank these query paths using evolution-conscious ranking functions. Then, these ranked query paths are used in evolution-conscious caching strategy for efficient xml query processing. Finally, we report our experimental results to show that our strategy is superior to previous query pattern-based caching approaches.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On the Discovery of Conserved XML Query Patterns for Evolution-Conscious Caching

Existing xml query pattern-based caching strategies focus on extracting the set of frequently issued query pattern trees (qpt) based on the support of the qpts in the history. These approaches ignore the evolutionary features of the qpts. In this paper, we propose a novel type of query pattern called conserved query paths (cqp) for efficient caching by integrating the support and evolutionary f...

متن کامل

Mining Frequently Changing Substructures from Historical Unordered XML Documents

Recently, there is an increasing research efforts in XML data mining. These efforts largely assumed that XML documents are static. However, in many real applications, XML data are evolutionary in nature. In this paper, we focus on mining evolution patterns from historical XML documents. Specifically, we propose a novel approach to discover frequently changing structures (FCS) from a sequence of...

متن کامل

Efficient Mining of XML Query Patterns for Caching

As XML becomes ubiquitous, the efficient retrieval of XML data becomes critical. Research to improve query response time has been largely concentrated on indexing paths, and optimizing XML queries. An orthogonal approach is to discover frequent XML query patterns and cache their results to improve the performance of XML management systems. In this paper, we present an efficient algorithm called...

متن کامل

FRECLE Mining: Discovering Frequent Semantic Tree Cluster Sequences from Historical Tree Structured Data

Mining frequent trees is very useful in domains like bioinformatics, web mining, mining semistructured data, and so on. Existing techniques focus on finding “structural” patterns and ignores the “semantics” that may be associated with the subtrees. In this paper we proposal an algorithm to mine a novel pattern called frequent semantic tree cluster sequences (FRECLE), which captures the frequent...

متن کامل

Mining Positive and Negative Association Rules from XML Query Patterns for Caching

Recently, several approaches that mine frequent XML query patterns and cache their results have been proposed to improve query response time. However, frequent XML query patterns mined by these approaches ignore the temporal sequence between user queries. In this paper, we take into account the temporal features of user queries to discover association rules, which indicate that when a user inqu...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2013